On the maximal distance between triangular embeddings of a complete graph
نویسندگان
چکیده
منابع مشابه
On the maximal distance between triangular embeddings of a complete graph
The distance d(f, f ′) between two triangular embeddings f and f ′ of a complete graph is the minimal number t such that we can replace t faces in f by t new faces to obtain a triangular embedding isomorphic to f ′. We consider the problem of determining the maximum value of d(f, f ′) as f and f ′ range over all triangular embeddings of a complete graph. The following theorem is proved: for eve...
متن کاملOn the minimal nonzero distance between triangular embeddings of a complete graph
Given two triangular embeddings f and f ′ of a complete graph K and given a bijection φ : V (K) → V (K), denote by M(φ) the set of faces (x, y, z) of f such that (φ(x), φ(y), φ(z)) is not a face of f . The distance between f and f ′ is the minimal value of |M(φ)| as φ ranges over all bijections between the vertices of K. We consider the minimal nonzero distance between two triangular embeddings...
متن کاملTriangular embeddings of complete graphs
In this paper we describe the generation of all nonorientable triangular embeddings of the complete graphs K12 and K13. (The 59 nonisomorphic orientable triangular embeddings of K12 were found in 1996 by Altshuler, Bokowski and Schuchert, and K13 has no orientable triangular embeddings.) There are 182, 200 nonisomorphic nonorientable triangular embeddings for K12, and 243, 088, 286 for K13. Tri...
متن کاملon translation of phatic communion and socio-cultural relationships between the characters of the novels
phatic communion is a cultural concept which differs across cultures. according to hofstede (2001), the u.s. tends to have individualistic culture; however, asian countries tend to have collectivistic cultures. these cultures view phatic communion differently. in individualistic cultures like u.s., phatic communion reflects speakers’ socio-cultural relationships in conversations. to see whether...
15 صفحه اولA graph distance metric based on the maximal common subgraph
Error-tolerant graph matching is a powerful concept that has various applications in pattern recognition and machine vision. In the present paper, a new distance measure on graphs is proposed. It is based on the maximal common subgraph of two graphs. The new measure is superior to edit distance based measures in that no particular edit operations together with their costs need to be defined. It...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2006
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2005.09.006